A Method of Statistical Randomness Test for Key Derivation Functions
نویسندگان
چکیده
منابع مشابه
A Randomness Test for Stable Data
In this paper, we propose a new method for checking randomness of non-Gaussian stable data based on a characterization result. This method is more sensitive with respect to non-random data compared to the well-known non-parametric randomness tests.
متن کاملKey Derivation and Randomness Extraction
Key derivation refers to the process by which an agreed upon large random number, often named master secret, is used to derive keys to encrypt and authenticate data. Practitioners and standardization bodies have usually used the random oracle model to get key material from a Diffie-Hellman key exchange. However, proofs in the standard model require randomness extractors to formally extract the ...
متن کاملA Note on Practical Key Derivation Functions
In this article, we first review key derivation functions specified in NIST SP 800-108 and one proposed by Krawczyk. Then, we propose parallelizable key derivation functions obtained by modifying or using the existing schemes. We also define two measures of efficiency of key derivation functions, and evaluate their performance in terms of the two measures. key words: key derivation, pseudorando...
متن کاملA New Statistical Randomness Test: Saturation Point Test
In this work, we propose a new statistical randomness test, the Saturation Point Test, which can be applied to integer sequences as well as binary sequences and is designed to increase the number of tests for short sequences. The subject of Saturation Point Test is the index of integer, denoted by SP , where all possible integers occur in the given sequence. We evaluate the probability Pr(SP = ...
متن کاملA Framework for Security Analysis of Key Derivation Functions
This paper presents a comprehensive formal security framework for key derivation functions (KDF). The major security goal for a KDF is to produce cryptographic keys from a private seed value where the derived cryptographic keys are indistinguishable from random binary strings. We form a framework of five security models for KDFs. This consists of four security models that we propose: Known Publ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartC
سال: 2010
ISSN: 1598-2858
DOI: 10.3745/kipstc.2010.17c.1.047